Strong Converse Using Change of Measure Arguments

Strong converse theorems using Rényi entropies

A strong converse for classical channel coding using entangled inputs.

A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical chan...

New Strong Converse for Asymmetric Broadcast Channels

We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.

Strong Converse Inequality for a Spherical Operator

In the paper titled as “Jackson-type inequality on the sphere” 2004 , Ditzian introduced a spherical nonconvolution operator Ot,r , which played an important role in the proof of the wellknown Jackson inequality for spherical harmonics. In this paper, we give the lower bound of approximation by this operator. Namely, we prove that there are constants C1 and C2 such that C1ω2r f, t p ≤ ‖Ot,rf − ...

Strong converse for identification via quantum channels

In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede’s recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking val...